Dynamic Complexity of the Dyck Reachability
نویسندگان
چکیده
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete edges. We show a strong dichotomy between such problems, based on the size of the Dyck alphabet. Some of them are P-complete (under a strong notion of reduction) while the others lie either in DynFO or in NL.
منابع مشابه
Courcelle's Theorem Made Dynamic
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic secondorder formula over evolving subgraphs of a fixed maximal graph having bounded tree-width; here the subgraph evolves by losing or gaining edges (from the maximal graph). We show that this problem is in DynFO (with LOGSPA...
متن کاملAn E � cient Algorithm for Solving the Dyck - CFL Reachability Problem on Trees ?
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as points-to-analysis. Solving the CFL reachability problem in the general case is very hard. Popular solutions resorting to a graph traversal exhibit a time complexity of O(kn) for a grammar of size k. For Dyck CFLs, a parti...
متن کاملAn Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as points-to-analysis. Solving the CFL reachability problem in the general case is very hard. Popular solutions resorting to a graph traversal exhibit a time complexity of O(kn) for a grammar of size k. For Dyck CFLs, a parti...
متن کاملDynamic Computation
This thesis is in Theory of Computation. We study quantitative aspects of computational problems that arise in settings where the input instance is subject to changes, i.e., dynamic problems. The results include e cient dynamic algorithms and data structures and strong information-theoretic lower bounds for problems on graphs, strings, and nite functions. Chapter 1 contains a brief introduction...
متن کاملDynamic Complexity of Parity Games with Bounded Tree-Width
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of two-player parity games over graphs of bounded tree-width, where updates may add or delete edges, or change the owner or color of states. We show that this problem is in DynFO (with LOGSPACE precomputation); this is achieved by a reduction to a Dyck-path p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017